import java.util.Arrays;

public class Test {
    public static void main(String[] args) {
        BinarySearchTree bsTree=new BinarySearchTree();
        bsTree.insert(12);
        bsTree.insert(2);
        bsTree.insert(4);
        bsTree.insert(9);
        bsTree.insert(18);
        bsTree.insert(16);
        bsTree.insert(10);
       // bsTree.prevOreder(bsTree.root);
       // System.out.println();
        bsTree.remove(9);
        // bsTree.prevOreder(bsTree.root);
       // System.out.println();
        bsTree.remove(16);
        //bsTree.prevOreder(bsTree.root);
        //System.out.println();
        bsTree.Convert(bsTree.root);
        int[] arr={7,11,8,4,16,2,19,21};
        System.out.println(Arrays.toString(arr));
        quick.quicksort(arr);
        System.out.println(Arrays.toString(arr));
    }
}
